Universal Invariant Checking of Parametric Systems with Quantifier-free SMT Reasoning

Abstract The problem of invariant checking in parametric systems – which are required to operate correctly regardless the number and connections their components is gaining increasing importance various sectors, such as communication protocols control software. Such typically modeled using quantified formulae, describing behaviour an unbounded (identical) components, automatic verification often relies on use decidable fragments first-order logic order effectively deal with challenges reasoning. In this paper, we propose a fully technique for does not rely Parametric array-based transition systems, our method iteratively constructs quantifier-free abstraction by analyzing, SMT-based algorithms non-parametric increasingly-larger finite instances system. Depending result concrete instance, automatically refined leveraging canditate lemmas from inductive invariants, or discarding previously computed lemmas. We implemented IC3 underlying engine. Our experimental evaluation demonstrates that approach competitive state art, solving several benchmarks out reach other tools.